type github.com/andybalholm/brotli.huffmanTree

27 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L338: func storeHuffmanTree(depths []byte, num uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L396: func buildAndStoreHuffmanTree(histogram []uint32, histogram_length uint, alphabet_size uint, tree []huffmanTree, depth []byte, bits []uint16, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L862: func encodeContextMap(context_map []uint32, context_map_size uint, num_clusters uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L927: func buildAndStoreBlockSplitCode(types []byte, lengths []uint32, num_blocks uint, num_types uint, tree []huffmanTree, code *blockSplitCode, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L954: func storeTrivialContextMap(num_types uint, context_bits uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1050: func buildAndStoreBlockSwitchEntropyCodes(self *blockEncoder, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1102: func buildAndStoreEntropyCodesLiteral(self *blockEncoder, histograms []histogramLiteral, histograms_size uint, alphabet_size uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1123: func buildAndStoreEntropyCodesCommand(self *blockEncoder, histograms []histogramCommand, histograms_size uint, alphabet_size uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1144: func buildAndStoreEntropyCodesDistance(self *blockEncoder, histograms []histogramDistance, histograms_size uint, alphabet_size uint, tree []huffmanTree, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1175: 	var tree []huffmanTree
		brotli_bit_stream.go#L1184: 	tree = make([]huffmanTree, maxHuffmanTreeSize)
		brotli_bit_stream.go#L1317: 	var tree []huffmanTree
		brotli_bit_stream.go#L1330: 	tree = make([]huffmanTree, maxHuffmanTreeSize)
		compress_fragment.go#L102: 	var tree [129]huffmanTree
		compress_fragment_two_pass.go#L48: 	var tree [129]huffmanTree
		entropy_encode.go#L14: type huffmanTree struct {
		entropy_encode.go#L20: func initHuffmanTree(self *huffmanTree, count uint32, left int16, right int16) {
		entropy_encode.go#L27: type huffmanTreeComparator func(huffmanTree, huffmanTree) bool
		entropy_encode.go#L31: func sortHuffmanTreeItems(items []huffmanTree, n uint, comparator huffmanTreeComparator) {
		entropy_encode.go#L36: 			var tmp huffmanTree = items[i]
		entropy_encode.go#L64: 				var tmp huffmanTree = items[i]
		entropy_encode.go#L76: func setDepth(p0 int, pool []huffmanTree, depth []byte, max_depth int) bool {
		entropy_encode.go#L107: func sortHuffmanTree(v0 huffmanTree, v1 huffmanTree) bool {
		entropy_encode.go#L130: func createHuffmanTree(data []uint32, length uint, tree_limit int, tree []huffmanTree, depth []byte) {
		entropy_encode.go#L132: 	var sentinel huffmanTree